Expanded lectures on binomial ideals

نویسنده

  • Irena Swanson
چکیده

Here is the gist of the Eisenbud–Sturmfels paper Binomial ideals, Duke Math. J. 84 (1996), 1–45. The main results are that the associated primes, the primary components, and the radical of a binomial ideal in a polynomial ring are binomial if the base ring is algebraically closed. Throughout, R = k[X1, . . . , Xn], where k is a field and X1, . . . , Xn are variables over k. A monomial is an element of the form X for some a ∈ Nn0 , and a term is an element of k times a monomial. The words “monomial” and “term” are often confused. In particular, a binomial is defined as the difference of two terms, so it should better be called a “biterm”, but this name is unlikely to stick. An ideal is binomial if it is generated by binomials. Here are some easy facts: (1) Every monomial is a binomial, hence every monomial ideal is a binomial ideal. (2) The sum of two binomial ideals is a binomial ideal. (3) The intersection of binomial ideals need not be binomial: (t−1)∩ (t−2), even over a field of characteristic 0. (4) Primary components of a binomial ideal need not be binomial: in R[t], the binomial ideal (t − 1) has exactly two primary components: (t− 1) and (t + t+ 1). (5) The radical of a binomial ideal need not be binomial: Let k = Z/2Z(t), R = k[X, Y ], I = (X + t, Y 2 + t + 1). Note that I is binomial (as t + 1 is in k), and √ I = (X+ t, X+Y +1), and this cannot be rewritten as a binomial ideal as there is only one generator of degree 1 and it is not binomial. Thus, we do need to make a further assumption, namely, from now on, all fields k are algebraically closed, and then the counterexamples to primary components and radicals do not occur. The ring is always R = k[X1, . . . , Xn], and t is always a variable over R. Comment: Can one repeat this for trinomial ideals (with obvious meanings)? The answer is that not really, because all ideals are trinomial – after adding variables and a change of variable. Namely, let f = a1 + a2 + · · · + am be a polynomial with m terms. Introduce new variables t3, . . . , tm. Then k[x1, . . . , xn]/(f) = k[x1, . . . , xn, t3, . . . , tm]/(a1+ a2 − t3,−t3 + a3 − t4,−t4 + a4 − t5, . . . ,−tm−2 + am−2 − tm−1,−tm−1 + am−1 − tm).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binomial Ideals David Eisenbud and Bernd Sturmfels

Introduction. It is notoriously difficult to deduce anything about the structure of an ideal or scheme by directly examining its defining polynomials. A notable exception is that of monomial ideals. Combined with techniques for making fiat degenerations of arbitrary ideals into monomial ideals (typically, using Gr6bner bases), the theory of monomial ideals becomes a useful tool for studying gen...

متن کامل

On the binomial edge ideals of block graphs

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.

متن کامل

Robustness and Conditional Independence Ideals

We study notions of robustness of Markov kernels and probability distribution of a system that is described by n input random variables and one output random variable. Markov kernels can be expanded in a series of potentials that allow to describe the system’s behaviour after knockouts. Robustness imposes structural constraints on these potentials. Robustness of probability distributions is def...

متن کامل

Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals

It is known that algorithms exist which compute primary decompositions of polynomial ideals (Gianni et al., 1988; Eisenbud et al., 1992; Becker and Weispfenning, 1993; and more recently Shimoyama and Yokoyama, 1996). However, in case the ideal is binomial, binomiality of its primary components is not assured, that is, the above algorithms do not necessarily compute a decomposition into binomial...

متن کامل

Log Canonical Thresholds of Binomial Ideals

We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013